A binary relation on a set that is reflexive and symmetric is called a compatible relation. 一个集合上的二元关系,如果它是自反的也是对称的,可称它为相容关系。
The results provides theory basis for knowledge acquisition of information systems and decision table based on general binary relation. 所得结果为在一般二元关系下的信息和决策表的知识获取提供了理论依据。
Matrix to determine whether it is reflexive and symmetric, Discrete Mathematics in the binary relation. 判断矩阵是否是自反的,对称的,离散数学中的二元关系。
The set E may be thought of as a binary relation on set V. 集合E可看成集合V上的一个二元关系。
Matrix Discriminance of Transitive Binary Relation in a Finite Set 有限集上二元关系传递性的矩阵判别法
Rough Entropy and Granularity Measure to Incomplete Information System Under the Reflexive Binary Relation 自反二元关系下不完备信息系统的粗糙熵及粒度度量
A Case Study: Carrying Out the Student and Learning-centered Education in the Course of the Secondary Schools Sex Education; Adult-oriented Physical Education from the Perspective of Binary Relation Theory 中学性教育中实施学生主体参与的教育研究二元关系论视阈中的成人主体性体育教育研究
A binary relation from a set A to A is said to be a binary relation on A. 从集合a到a的二元关系,称为a上的二元关系。
Concepts related to grid service are given in this paper based on binary relation theory. 基于二元关系理论,给出了与网格服务关系相关的一些概念。
This paper transforms the pattern learning in the extraction of binary relation into the learning of centre of single text class. 本文首先将在二元关系抽取中的模式学习问题转化为单类文本中心的学习问题。
An auxiliary relation is an important binary relation on a poset. 辅助关系是定义在偏序集上的一种重要的二元关系。
The Treatise on the Matrix Representation of Bivariate Recurrence Sequences and Combinatorial Inversion; A binary relation on a set that is reflexive and symmetric is called a compatible relation. 二元迭代关系的矩阵表示与组合反演关系理论一个集合上的二元关系,如果它是自反的也是对称的,可称它为相容关系。
Adult-oriented Physical Education from the Perspective of Binary Relation Theory 二元关系论视阈中的成人主体性体育教育研究
We deal with transitivity and transitive closure for binary relation. We put forward the concept of middle point, obtain invariance of transitivity under power product of binary relation and simplify the algorithm in computing transitive closure. 探讨了二元关系传递性的判定和传递闭包的计算及其教学的有关问题,提出了中途点的概念,得到传递性在乘幂运算下的不变性,以及简化了计算传递闭包的算法。
Mathematical characteristics of the relation matrixes corresponding to the usual properties of the binary relation on the finite set are given, and based on these characteristics the Matlab programs are compiled, the generality of the program is higher. 对于有限集合上二元关系的常用性质,本文给出了相应的关系矩阵的数学刻画,并根据这些刻画编制了对应的Matlab程序,程序的通用性更强。
The main contributions include: 1. The roughness and reduction of incomplete information systems based on binary relation are studied. 研究了基于一般二元关系信息系统的不确定性度量和知识约简。
In other words properties of binary relation are expressed by logic formulae through introduce corresponding predicate. 换句话说,就是通过引入相应的谓词,将二元关系的性质用逻辑公式来表示。
Entropy of Knowledge and Rough Set Based on General Binary Relation 基于一般二元关系的知识粗糙熵与粗集粗糙熵
In this paper, the upper and low rough approximation operators based on general binary relation of Vague set are studied. 本文研究了一般关系下Vague集合的近似问题,建立了一般关系下粗糙Vague近似的框架。
This paper discusses some conservation's properties of operation to binary relation. 本文主要论述了二元关系对运算的一些守恒性质。
( Besides), we realized the reasoning of these spatial relations by showing that each Allen's basic binary relation can be associated with a fuzzy relation and obtaining an Allen's algorithm based on these fuzzy relations. 此外,还给出了与Allen提出的二元基本关系关联的模糊关系,并得到了基于模糊关系的Allen推理算法,从而实现了空间关系间的推理。
In this paper, the roughness of knowledge and rough set is denoted by their rough entropy with respect to general binary relation, which provides theory basis for knowledge acquisition in information systems based on general binary relation. 针对一般二元关系(自反的),通过引入知识粗糙熵来刻画知识的粗糙性和粗集粗糙性,为以一般二元关系为基础的信息系统中知识的获取提供了理论依据。
The fuzzy entropy based on equivalent relation is extended to generalize the fuzzy entropy based on general binary relation, and the calculating formula and the equivalent expression of the generalized fuzzy entropy are also given. 并将基于等价关系的粗糙集的模糊熵拓展到基于一般二元关系下粗糙集的广义模糊熵,给出了广义模糊熵的计算公式及等效表示形式。
By using Fuzzy ideals of BCI-algebra, a binary relation is definited, and that being a congruent relation is proved, thus, quotient BCI-algebras are constructed. 利用BCI-代数的Fuzzy理想定义了一个二元关系,证明了这个二元关系是同余关系,从而构造了商BCI-代数。
A revealed preference binary relation is defined based on the path independence choice function, and the revealed preference relation happens to be a partial order, some further conclusions are driven based on this property, and the relative proof is given. 其次,通过路径无关性选择函数定义了一个展示偏好二元关系,证明了此展示偏好正好具有偏序特征,并得到了一些进一步的性质。
By defining appropriate matrices, rules extraction approaches for maximum distribution and assignment rules based on general binary relation, the upper/ lower approximation rule extraction based on tolerance and similarity relation are studied. 通过定义适当的矩阵,提出了基于一般二元关系的最大分布规则、分配规则、基于相容关系的上下近似规则和基于相似关系的上下近似规则的矩阵算法。
Thirdly, six knowledge reductions are defined under general binary relation-based incomplete information systems, and the relations between them are discussed. 在一般二元关系下定义了六种知识约简,讨论了它们之间的关系。
A concept lattice is an ordered hierarchy that is defined by a binary relation between objects and attributes in a data set. 概念格是一个序层次结构,它由数据表中对象和属性间二元关系产生。
In chapter five, we discuss the fact which the approximation operator properties and binary relation influence the choice of basis algebra. 第五章讨论了近似算子、二元关系对于基代数的制约关系,并在基代数的框架下对于近似算子的形式进行了探讨。
Representations in deep and low level are not of binary relation, but of different stages. 深层表征和浅层表征并非二元关系,而是具有等级的尺度。